منابع مشابه
Parametric λ-Theories
The parametric lambda calculus subsumes different existing λ-calculi, in particular the classical λβ-calculus and the λβv-calculus of Plotkin. Previously established results on the parametric calculus, such as as confluence and standardization, are primarily syntactical. In this paper our attention is mainly addressed to semantics, although we start again from a syntactical point of view. We pr...
متن کاملEffective λ-models versus recursively enumerable λ-theories
A longstanding open problem is whether there exists a non-syntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ . In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which cove...
متن کاملModels and theories of λ-calculus
In this paper we briefly summarize the contents of Manzonetto’s PhD thesis [35] which concerns denotational semantics and equational/order theories of the pure untyped λ-calculus. The main research achievements include: (i) a general construction of λ-models from reflexive objects in (possibly non-well-pointed) categories; (ii) a Stonestyle representation theorem for combinatory algebras; (iii)...
متن کاملCombined Satisfiability Modulo Parametric Theories
We give a fresh theoretical foundation for designing comprehensive SMT solvers, generalizing in a practically motivated direction. We define parametric theories that most appropriately express the “logic” of common data types. Our main result is a combination theorem for decision procedures for disjoint theories of this kind. Virtually all of the deeply nested data structures (lists of arrays o...
متن کاملSolution of a Problem of Barendregt on Sensible Λ-theories
H is the theory extending β-conversion by identifying all closed unsolvables. Hω is the closure of this theory under the ω-rule (and β-conversion). A long-standing conjecture of H. Barendregt states that the provable equations of Hω form a Π11-complete set. Here we prove that conjecture.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.01.021